On Ky Fan's Section Theorem
نویسندگان
چکیده
منابع مشابه
Oriented matroids and Ky Fan's theorem
L. Lovász has shown in [9] that Sperner’s combinatorial lemma admits a generalization involving a matroid defined on the set of vertices of the associated triangulation. We prove that Ky Fan’s theorem admits an oriented matroid generalization of similar nature (Theorem 3.1). Classical Ky Fan’s theorem is obtained as a corollary if the underlying oriented matroid is chosen to be the alternating ...
متن کاملA Mihalisin-Klee Theorem for Fans
The Mihalisin Klee Theorem states that an orientation of a 3-polytopal graph is induced by an affine function on some 3-polytope realizing the graph if the orientation is acyclic, has a unique source and a unique sink, and admits three independent monotone paths from the source to the sink. We replace the requirement that the orientation is acyclic with the assumption that it has no directed cy...
متن کاملStatman's 1-Section Theorem
Statman's 1-Section Theorem [17] is an important but little-known result in the model theory of the simplytyped λ-calculus. The λ-Section Theorem states a necessary and sufficient condition on models of the simplytyped λ-calculus for determining whether βη-equational reasoning is complete for proving equations that hold in a model. We review the statement of the theorem, give a detailed proof, ...
متن کاملEvolution of the 1984 KKM theorem of Ky Fan
*Correspondence: [email protected]; [email protected] The National Academy of Sciences, ROK, Seoul, 137-044, Korea Department of Mathematical Sciences, Seoul National University, Seoul, 151-747, Korea Abstract Recently we established the Knaster, Kuratowski, and Mazurkiewicz (KKM) theory on abstract convex spaces. In our research, we noticed that there are quite a few generalizations and a...
متن کاملLocal Chromatic Number, KY Fan's Theorem, And Circular Colorings
The local chromatic number of a graph was introduced in [12]. It is in between the chromatic and fractional chromatic numbers. This motivates the study of the local chromatic number of graphs for which these quantities are far apart. Such graphs include Kneser graphs, their vertex color-critical subgraphs, the Schrijver (or stable Kneser) graphs; Mycielski graphs, and their generalizations; and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1998
ISSN: 0022-247X
DOI: 10.1006/jmaa.1998.6081